Pinar Heggernes : rechercher sur Z-Library

Le plus grand référentiel d'articles scientifiques au monde. 70,000,000+ d'articles gratuitement.

Don't use scam websites

Livres
Articles (117)
Les plus populaires
Liste
- Liste
- Tableau

1

Partitioning a graph into degenerate subgraphs

Abu-Khzam, Faisal N., Feghali, Carl, Heggernes, Pinar

Journal:

European Journal of Combinatorics

Année:

2020

Langue:

english

Fichier:

PDF, 365 KB

english, 2020

2

Scheduling unit-length jobs with precedence constraints of small height

Berger, André, Grigoriev, Alexander, Heggernes, Pinar, van der Zwaan, Ruben

Journal:

Operations Research Letters

Année:

2014

Langue:

english

Fichier:

PDF, 475 KB

english, 2014

3

Computing the metric dimension for chain graphs

Fernau, Henning, Heggernes, Pinar, van 't Hof, Pim, Meister, Daniel, Saei, Reza

Journal:

Information Processing Letters

Année:

2015

Langue:

english

Fichier:

PDF, 318 KB

english, 2015

4

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width

Golovach, Petr A., Heggernes, Pinar, Kanté, Mamadou Moustapha, Kratsch, Dieter, Sæther, Sigve H., Villanger, Yngve

Journal:

Année:

2017

Langue:

english

Fichier:

PDF, 766 KB

english, 2017

5

Mixed search number and linear-width of interval and split graphs

Fedor V. Fomin, Pinar Heggernes, Rodica Mihai

Journal:

Année:

2010

Langue:

english

Fichier:

PDF, 107 KB

english, 2010

6

Contracting chordal graphs and bipartite graphs to paths and trees

Pinar Heggernes, Pim van ʼt Hof, Benjamin Lévêque, Paul Christophe

Journal:

Electronic Notes in Discrete Mathematics

Année:

2011

Langue:

english

Fichier:

PDF, 170 KB

english, 2011

7

Minimal comparability completions of arbitrary graphs

Pinar Heggernes, Federico Mancini, Charis Papadopoulos

Journal:

Discrete Applied Mathematics

Année:

2008

Langue:

english

Fichier:

PDF, 262 KB

english, 2008

8

Dynamically maintaining split graphs

Pinar Heggernes, Federico Mancini

Journal:

Discrete Applied Mathematics

Année:

2009

Langue:

english

Fichier:

PDF, 801 KB

english, 2009

9

Minimal split completions

Pinar Heggernes, Federico Mancini

Journal:

Discrete Applied Mathematics

Année:

2009

Langue:

english

Fichier:

PDF, 757 KB

english, 2009

10

Guest Editors’ Foreword

Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski

Journal:

Discrete Applied Mathematics

Année:

2010

Langue:

english

Fichier:

PDF, 174 KB

english, 2010

11

A vertex incremental approach for maintaining chordality

Anne Berry, Pinar Heggernes, Yngve Villanger

Journal:

Discrete Mathematics

Année:

2006

Langue:

english

Fichier:

PDF, 323 KB

english, 2006

12

Optimal broadcast domination in polynomial time

Pinar Heggernes, Daniel Lokshtanov

Journal:

Discrete Mathematics

Année:

2006

Langue:

english

Fichier:

PDF, 244 KB

english, 2006

13

A completely dynamic algorithm for split graphs

Federico Mancini, Pinar Heggernes

Journal:

Electronic Notes in Discrete Mathematics

Année:

2006

Langue:

english

Fichier:

PDF, 100 KB

english, 2006

14

Hardness and approximation of minimum distortion embeddings

Pinar Heggernes, Daniel Meister

Journal:

Information Processing Letters

Année:

2010

Langue:

english

Fichier:

PDF, 165 KB

english, 2010

15

A wide-range algorithm for minimal triangulation from an arbitrary ordering

Anne Berry, Jean-Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger

Journal:

Journal of Algorithms

Année:

2006

Langue:

english

Fichier:

PDF, 286 KB

english, 2006

16

Bandwidth of bipartite permutation graphs in polynomial time

Pinar Heggernes, Dieter Kratsch, Daniel Meister

Journal:

Journal of Discrete Algorithms

Année:

2009

Langue:

english

Fichier:

PDF, 262 KB

english, 2009

17

Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions

Pinar Heggernes, Charis Papadopoulos

Journal:

Theoretical Computer Science

Année:

2009

Langue:

english

Fichier:

PDF, 1010 KB

english, 2009

18

Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs

Pinar Heggernes, Daniel Meister, Andrzej Proskurowski

Journal:

Theoretical Computer Science

Année:

2011

Langue:

english

Fichier:

PDF, 453 KB

english, 2011

19

A practical algorithm for making filled graphs minimal

Jean R.S. Blair, Pinar Heggernes, Jan Arne Telle

Journal:

Theoretical Computer Science

Année:

2001

Langue:

english

Fichier:

PDF, 224 KB

english, 2001

20

Finding minimum height elimination trees for interval graphs in polynomial time

Bengt Aspvall, Pinar Heggernes

Journal:

BIT Numerical Mathematics

Année:

1994

Langue:

english

Fichier:

PDF, 1.62 MB

english, 1994

21

Exact Algorithms for Graph Homomorphisms

Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch

Journal:

Theory of Computing Systems

Année:

2007

Langue:

english

Fichier:

PDF, 210 KB

english, 2007

22

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton

Journal:

Année:

2004

Langue:

english

Fichier:

PDF, 146 KB

english, 2004

23

Graph Searching, Elimination Trees, and a Generalization of Bandwidth

Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle

Journal:

Année:

2005

Langue:

english

Fichier:

PDF, 161 KB

english, 2005

24

Faster Parameterized Algorithms forMinimum Fill-in

Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger

Journal:

Année:

2011

Langue:

english

Fichier:

PDF, 695 KB

english, 2011

25

Strongly chordal and chordal bipartite graphs are

Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan

Journal:

Journal of Combinatorial Optimization

Année:

2011

Langue:

english

Fichier:

PDF, 634 KB

english, 2011

26

Minimal triangulations of graphs: A survey

Pinar Heggernes

Journal:

Discrete Mathematics

Année:

2006

Langue:

english

Fichier:

PDF, 371 KB

english, 2006

27

Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree

Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet

Journal:

Theoretical Computer Science

Année:

2008

Langue:

english

Fichier:

PDF, 1.14 MB

english, 2008

28

Clustering with partial information

Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances Rosamond

Journal:

Theoretical Computer Science

Année:

2010

Langue:

english

Fichier:

PDF, 661 KB

english, 2010

29

Contracting Graphs to Paths and Trees

Heggernes, Pinar, Hof, Pim, Lévêque, Benjamin, Lokshtanov, Daniel, Paul, Christophe

Journal:

Année:

2014

Langue:

english

Fichier:

PDF, 838 KB

english, 2014

30

Edge search number of cographs

Petr A. Golovach, Pinar Heggernes, Rodica Mihai

Journal:

Discrete Applied Mathematics

Année:

2012

Langue:

english

Fichier:

PDF, 254 KB

english, 2012

31

Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs

Pinar Heggernes, Daniel Meister, Charis Papadopoulos

Journal:

Discrete Applied Mathematics

Année:

2012

Langue:

english

Fichier:

PDF, 305 KB

english, 2012

32

Edge contractions in subclasses of chordal graphs

Rémy Belmonte, Pinar Heggernes, Pim van ’t Hof

Journal:

Discrete Applied Mathematics

Année:

2012

Langue:

english

Fichier:

PDF, 296 KB

english, 2012

33

Guest editors’ foreword

Pinar Heggernes, Jan Kratochvíl, Andrzej Proskurowski

Journal:

Discrete Applied Mathematics

Année:

2012

Langue:

english

Fichier:

PDF, 394 KB

english, 2012

34

Computing role assignments of proper interval graphs in polynomial time

Pinar Heggernes, Pim van ʼt Hof, Daniël Paulusma

Journal:

Journal of Discrete Algorithms

Année:

2012

Langue:

english

Fichier:

PDF, 385 KB

english, 2012

35

Graphs of linear clique-width at most 3

Pinar Heggernes, Daniel Meister, Charis Papadopoulos

Journal:

Theoretical Computer Science

Année:

2011

Langue:

english

Fichier:

PDF, 428 KB

english, 2011

36

Bandwidth on AT-free graphs

Petr Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh

Journal:

Theoretical Computer Science

Année:

2011

Langue:

english

Fichier:

PDF, 257 KB

english, 2011

37

Interval Completion Is Fixed Parameter Tractable

Villanger, Yngve, Heggernes, Pinar, Paul, Christophe, Telle, Jan Arne

Journal:

SIAM Journal on Computing

Année:

2009

Langue:

english

Fichier:

PDF, 204 KB

english, 2009

38

Cutwidth of Split Graphs and Threshold Graphs

Heggernes, Pinar, Lokshtanov, Daniel, Mihai, Rodica, Papadopoulos, Charis

Journal:

SIAM Journal on Discrete Mathematics

Année:

2011

Langue:

english

Fichier:

PDF, 418 KB

english, 2011

39

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

Heggernes, Pinar, van 't Hof, Pim, Lokshtanov, Daniel, Nederlof, Jesper

Journal:

SIAM Journal on Discrete Mathematics

Année:

2012

Langue:

english

Fichier:

PDF, 283 KB

english, 2012

40

Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)

Heggernes, Pinar, Telle, Jan Arne, Villanger, Yngve

Journal:

SIAM Journal on Discrete Mathematics

Année:

2005

Langue:

english

Fichier:

PDF, 205 KB

english, 2005

41

Fast Computation of Minimal Fill Inside A Given Elimination Ordering

Heggernes, Pinar, Peyton, Barry W.

Journal:

SIAM Journal on Matrix Analysis and Applications

Année:

2009

Langue:

english

Fichier:

PDF, 268 KB

english, 2009

42

A new representation of proper interval graphs with an application to clique-width

Pinar Heggernes, Daniel Meister, Charis Papadopoulos

Journal:

Electronic Notes in Discrete Mathematics

Année:

2009

Langue:

english

Fichier:

PDF, 216 KB

english, 2009

43

Polar permutation graphs are polynomial-time recognisable

Tınaz Ekim, Pinar Heggernes, Daniel Meister

Journal:

European Journal of Combinatorics

Année:

2013

Langue:

english

Fichier:

PDF, 634 KB

english, 2013

44

Choosability on H-free graphs

Golovach, Petr A., Heggernes, Pinar, van ʼt Hof, Pim, Paulusma, Daniël

Journal:

Information Processing Letters

Année:

2013

Langue:

english

Fichier:

PDF, 156 KB

english, 2013

45

Enumerating Minimal Subset Feedback Vertex Sets

Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos…

Journal:

Année:

2014

Langue:

english

Fichier:

PDF, 627 KB

english, 2014

46

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

Heggernes, Pinar, van ’t Hof, Pim, Marx, Dániel, Misra, Neeldhara, Villanger, Yngve

Journal:

Année:

2015

Langue:

english

Fichier:

PDF, 915 KB

english, 2015

47

Contracting chordal graphs and bipartite graphs to paths and trees

Heggernes, Pinar, van ’t Hof, Pim, Lévêque, Benjamin, Paul, Christophe

Journal:

Discrete Applied Mathematics

Année:

2014

Langue:

english

Fichier:

PDF, 384 KB

english, 2014

48

Minimal dominating sets in graph classes: Combinatorial bounds and enumeration

Couturier, Jean-François, Heggernes, Pinar, van ’t Hof, Pim, Kratsch, Dieter

Journal:

Theoretical Computer Science

Année:

2013

Langue:

english

Fichier:

PDF, 468 KB

english, 2013

49

Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization

Heggernes, Pinar, Kratsch, Dieter, Lokshtanov, Daniel, Raman, Venkatesh, Saurabh, Saket

Journal:

Information and Computation

Année:

2013

Langue:

english

Fichier:

PDF, 251 KB

english, 2013

50

Finding clubs in graph classes

Golovach, Petr A., Heggernes, Pinar, Kratsch, Dieter, Rafiey, Arash

Journal:

Discrete Applied Mathematics

Année:

2014

Langue:

english

Fichier:

PDF, 469 KB

english, 2014